Preheating with fractional powers
نویسندگان
چکیده
منابع مشابه
Domination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملA Binary Additive Equation Involving Fractional Powers
with integers m1, m2; henceforth, [θ] denotes the integral part of θ. Subsequently, the range for c in this result was extended by Gritsenko [3] and Konyagin [5]. In particular, the latter author showed that (1) has solutions in integers m1, m2 for 1 < c < 3 2 and n sufficiently large. The analogous problem with prime variables is considerably more difficult, possibly at least as difficult as t...
متن کاملAvoiding fractional powers over the natural numbers
We study the lexicographically least infinite a/b-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least 7/4-power-free word is a fixed point of a 50847-uniform morphism. We identify the structure of the lexicographically least a/b-power-free word for three infinit...
متن کاملDomination Number of Graph Fractional Powers
For any k ∈ N, the k-subdivision of a graph G is a simple graph G 1 k , which is constructed by replacing each edge of G with a path of length k. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the mth power of the n-subdivision of G has been introduced as a fractional power of G, denoted by G m n . In this regard, we investig...
متن کاملOn Coloring of graph fractional powers
Let G be a simple graph. For any k ∈ N , the k−power of G is a simple graph G with vertex set V (G) and edge set {xy : dG(x, y) ≤ k} and the k−subdivision of G is a simple graph G 1 k , which is constructed by replacing each edge of G with a path of length k. So we can introduce the m−power of the n−subdivision of G, as a fractional power of G, that is denoted by G m n . In other words G m
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Physics Letters A
سال: 2016
ISSN: 0217-7323,1793-6632
DOI: 10.1142/s0217732316502175